Exploiting Opportunities Using Planning Graphs
نویسندگان
چکیده
Opportunities arise in planning when changes in the environment make new propositions available to the planner. Replanning methods often focus only on the negative e ects that changes in the environment have and therefore do not apply well. This paper introduces a method that is speci cally focused on the opportunity problem. This method is based on the potential graph structure. This potential graph is basically an annotated version of the planning graph as used in many contemporary planners. We show how this potential graph can be used to discover the positive impact of opportunities. This information can then be used to improve upon the plan by exploiting such opportunities. The bene t of this method over standard planning techniques is two-fold: rstly, it can be used in an any-time algorithm. That is, when only little time is available, little improvements are quickly found. With more time available, greater improvements may be found. Secondly, this technique helps us focus on those parts of the plan that might be improved. Other parts are not changed, which greatly adds to the e ciency of the method. The applicability of the method is demonstrated by some initial experiments.
منابع مشابه
Using Planning Graphs for Solving HTN Planning Problems
In this paper we present the GraphHTN algorithm, a hybrid planning algorithm that does Hierarchical Task-Network (HTN) planning using a combination of HTN-style problem reduction and Graphplan-style planning-graph generation. We also present experimental results comparing GraphHTN with ordinary HTN decomposition (as implemented in the UMCP planner) and ordinary Graphplan search (as implemented ...
متن کاملState agnostic planning graphs: deterministic, non-deterministic, and probabilistic planning
Planning graphs have been shown to be a rich source of heuristic information for many kinds of planners. In many cases, planners must compute a planning graph for each element of a set of states, and the naive technique enumerates the graphs individually. This is equivalent to solving an all-pairs shortest path problem by iterating a single-source algorithm over each source. We introduce a stru...
متن کاملState Agnostic Planning Graphs and the Application to Belief-Space Planning
Planning graphs have been shown to be a rich source of heuristic information for many kinds of planners. In many cases, planners must compute a planning graph for each element of a set of states. The naive technique enumerates the graphs individually. This is equivalent to solving an all-pairs shortest path problem by iterating a single-source algorithm over each source. We introduce a structur...
متن کاملExploiting Path Refinement Abstraction in Domain Transition Graphs
Partial Refinement A-Star (PRA ) is an abstraction technique, based on clustering nearby nodes in graphs, useful in large path-planning problems. Abstracting the underlying graph yields a simpler problem whose solution can be used, by refinement, as a guide to a solution to the original problem. A fruitful way to view domain independent planning problems is as a collection of multi-valued varia...
متن کاملOCL-Graph: Exploiting Object Structure in a Plan Graph Algorithm
In this paper we discuss and describe preliminary results of integrating two strands of planning research that of using plan graphs to speed up planning, and that of using object representations to better represent planning domain models. To this end we have designed and implemented OCL-graph, a plan generator which builds and searches an object-centred plan graph, extended to deal with conditi...
متن کامل